package com.leetcode.LCP;

public class LCP06 {
    public int minCount(int[] coins) {

        int count = 0;
        for (int coin : coins) {
            count += coin / 2 + coin % 2;
        }
        return count;
    }

    public int minCount2(int[] coins) {

        int count = 0;
        for (int coin : coins) {
            count += (coin + 1) / 2;
        }
        return count;
    }
}
